Location:
Search - b tree
Search list
Description: 编写一个程序实现顺序栈的各种基本运算,并在此基础上设计一个主程序完成如下功能：
1． 初始化栈S。
2． 判断栈S是否为空。
3． 依次进栈元素a,b,c,d,e。
4． 判断栈S是否为空。
5． 输出栈长度。
6． 输出从栈顶到栈底的元素。
7． 输出出栈序列。
8． 判断栈S是否为空。
9． 释放栈。-Realize the order of the preparation of a program stack of basic computing, and on this basis the design of a main program to complete the following functions: 1. Initialize stack S. 2. To determine whether the stack S is empty. 3. Elements into the stack followed by a, b, c, d, e. 4. To determine whether the stack S is empty. 5. The length of the output stack. 6. Output from the Top-stack at the end of the element. 7. Output sequence of the stack. 8. To determine whether the stack S is empty. 9. Release stack.
Platform: |
Size: 4096 |
Author: jiangyumin |
Hits:
Description: 严版数据结构。二叉树。功能齐全。经过调试。没有b+b_ 树。（c语言）。-Strict version of data structure. Binary tree. Full-featured. After debugging. No b+ B_ tree. (C language).
Platform: |
Size: 230400 |
Author: caixu |
Hits:
Description: 数据结构
1、算法思路：
哈夫曼树算法：a）根据给定的n个权值{W1，W2… ，Wn }构成 n棵二叉树的集合F={T1，T2…，T n }，其中每棵二叉树T中只有一个带权为W i的根结点，其左右子树均空；b）在F中选取两棵根结点的权值最小的树作为左右子树构造一棵新的二叉树，且置新的二叉树的根结点的权值为其左、右子树上结点的权值之和；c）F中删除这两棵树，同时将新得到的二叉树加入F中； d）重复b)和c),直到F只含一棵树为止。
-Data Structure 1, Algorithm idea: Huffman tree algorithm: a) in accordance with a given value of n of the right (W1, W2 ..., Wn) constitute a set of n binary tree trees F = (T1, T2 ..., T n) , which for each binary tree T with only one right for the W i of the root node, its about subtree are empty b) in the F 2 in the root node of the right to select the smallest value of the tree as a subtree structure around a new binary tree, binary tree and the new home of the root node of the right value for the left and right sub-tree nodes and the right value c) F in the deletion of the two trees, at the same time obtained by adding a new binary tree F in d) repeat b) and c), until a tree F containing only so far.
Platform: |
Size: 28672 |
Author: Anson |
Hits:
Description: B/S的OA，学习不错，用ASP.NET跟C#-err
Platform: |
Size: 283648 |
Author: 不知道 |
Hits:
Description: 数据结构中B-树经典算法的可视化执行程序-Data structure in the classic B-tree algorithm visualization procedures
Platform: |
Size: 1095680 |
Author: 大宝 |
Hits:
Description: 该题目要求使用LED16*16显示矩阵设计接口滚动显示汉字。使用8255把cpu与显示外设LED联系起来。16*16LED是16列阴极连在一起，16列阳极连在一起的256个二极管矩阵，当阳极为高电平，阴极为低电平时，二极管发光。通过8255的A口接前8列，高电平有效，C口接后8列，高电平有效，B口接前8行，低电平有效。-The subject requires the use of LED16* 16 show that the design interface matrix rolling display of Chinese characters. Using 8255 cpu and display peripherals LED link. 16* 16LED is linked to the cathode 16, anode 16 linked to the diode matrix 256, when the anode is high, the cathode is low, the light-emitting diodes. Of A through 8255 before I received eight, high effective, C after I received eight, high effective, B I take pre-8 line, active-low.
Platform: |
Size: 67584 |
Author: zhang shun |
Hits:
Description: H.264 decoder include b or no b frame decode and include cabac or uvlc decode
100％ work by Jesse Stone taiwan,H.264 decoder include b or no b frame decode and include cabac or uvlc decode100 work by Jesse Stone taiwan
Platform: |
Size: 1912832 |
Author: 小誠 |
Hits:
Description: Here is a demo on B plus tree~
Platform: |
Size: 7168 |
Author: Chan Fuk Wai |
Hits:
Description: 这是一个利用B+ Trees数据结构存储数据的源码,全部代码用C语言写的.-This is a use of B+ Trees data structure storing data source, all code written using C language.
Platform: |
Size: 58368 |
Author: 小刚 |
Hits:
Description: B+树的演示程序，在vs.net 2003 下编译通过。是数据库基础的课程设计。-B+ Tree demo program in vs.net 2003 adopted under the compiler. Is a database-based curriculum design.
Platform: |
Size: 1523712 |
Author: 赵瑞峰 |
Hits:
Description: B树的实现以及图形化显示，实现B树的插入、删除、显示-B-tree, as well as realize graphical display, the realization of B-tree insertion, deletion, indicating
Platform: |
Size: 2011136 |
Author: 林文 |
Hits:
Description: 实现B树，并在MFC中将其画出。
B树的表示及基本操作的实现。
1．掌握B树的存贮结构。
2．实现B树中关键字值的插入及删除操作。
3．屏幕图形化的显示。
-Realize B tree, and MFC will be the draw. B tree express and realize the basic operations. 1. Grasp the B-tree storage structure. 2. Keyword realize the value of B tree insertion and deletion. 3. Screen graphical display.
Platform: |
Size: 1916928 |
Author: beastman |
Hits:
Description: 超大规模集成电路设计中，布图规划的布局表示B*-tree和相应算法的实现，在linux环境中编译运行-VLSI design, floorplanning express the layout and the corresponding B*- tree algorithm, in the linux environment running the compiler
Platform: |
Size: 221184 |
Author: 陈望川 |
Hits:
Description: 、该个词法分析器要求至少能够识别以下几类单词：
a． 关键字：else if int return void while共6个，所有的关键字都是保留字，并且必须是小写；
b． 标识符：识别与C语言词法规定相一致的标识符，通过下列正则表达式定义：ID = letter (letter | digit)*；
c． 常数：NUM=(+ | - |ε)digit digit*(.digit digit* |ε)(e(+ | - |ε) digit digit* |ε)，letter = a|..|z|A|..|Z|，digit = 0|..|9，包括整数，如123, -123, +123等；小数，如123.45, +123.45, -123.45；科学计数法表示的常数，如+1.23e3，-2.3e-9；
d． 专用符号：+ - * / < <= > >= == != = , ( ) [ ] { } /* */；
-, Which require at least a lexical analyzer can identify the following types of words: a. Keyword: else if int return void while a total of six, all keywords are reserved words and must be lowercase b. Identifier: Identification and C language provides consistent lexical identifiers, through the definition of the following regular expression: ID = letter (letter | digit)* c. Constants: NUM = (+ |- | Ε) digit digit* (. Digit digit* | ε) (e (+ |- | Ε) digit digit* | ε), letter = a | .. | z | A | .. | Z |, digit = 0 | .. | 9, including integer, such as 123,-123,+ 123, etc. decimals, such as 123.45,+ 123.45,-123.45 science express constant counting method, such as+ 1.23e3,-2.3e-9 d. Special symbols:+-*/
Platform: |
Size: 2048 |
Author: dujuan |
Hits:
Description: 使用B+树实现文件倒排索引，查找关键词染色，根据出现频率排序-The use of B+ Tree file inverted index to find keywords staining, according to frequency of occurrence order
Platform: |
Size: 4994048 |
Author: chenqi |
Hits:
Description: 正整数x 的约数是能整除x 的正整数。正整数x 的约数个数记为div(x)。例如，1，2，5，10 都是正整数10 的约数，且div(10)=4。设a 和b 是2 个正整数，a≤b，找出a 和b之间约数个数最多的数x。
对于给定的2 个正整数a≤b，编程计算a 和b 之间约数个数最多的数。
数据输入
输入数据由文件名为input.txt的文本文件提供。文件的第1 行有2 个正整数a和b。
结果输出
程序运行结束时，若找到的a 和b 之间约数个数最多的数是x，将div(x)输出到文件output.txt中。
输入文件示例 输出文件示例
input.txt output.txt
1 36 9
-Positive integer x can be about a few of the positive integer x divisible. Positive integer x the approximate number recorded as the number of div (x). For example, 1,2,5,10 are about 10 positive integer number, and div (10) = 4. Set a and b are two positive integers, a ≤ b, to find a and b between about a few number of the largest number of x. For a given two positive integers a ≤ b, Programming calculated a and b between about a few number of the largest number. Data entry input data from the document text file named input.txt provide. File line 1 has two positive integers a and b. The results run the end of the output, if found between a and b of about a few number of the largest number are x, the div (x) of output to a file output.txt. Sample input file output file example input.txt output.txt 1 36 9
Platform: |
Size: 1024 |
Author: 林雨 |
Hits:
Description: 适合C++初学者的入门书籍。深入C++系列，中文版；Stanley B Lippman著；潘爱民 张丽译；中国电力出版社；内容分五篇，共20章，很全面。-For C++ Introductory books for beginners. Depth C++ Series, the Chinese version Stanley B Lippman forward PAN Ai-min Zhang Li translation China Electric Power Publishing House the contents of sub-5, a total of 20 chapters, very comprehensive.
Platform: |
Size: 3996672 |
Author: lixiaoyang |
Hits:
Description: 1.B树的实现
2.ElfHash的实现
3.三种排序方式(插入，归并，快速）-1.B tree 2.ElfHash to achieve the realization of 3. Three Sort by (insert, merging, fast)
Platform: |
Size: 9216 |
Author: yuyuanming |
Hits:
Description: b+树的实现和测试，模拟磁盘文件工作。一门课程的project。-b+ tree realization and testing, analog disk paperwork. A curriculum project.
Platform: |
Size: 1160192 |
Author: 俞凌杰 |
Hits:
Description: b-树的增加,删除,已对八百万个数据进行过测试,而且是对多个M值-b-tree to add, delete, 8,000,000 have been tested data, but also on a number of M values
Platform: |
Size: 3072 |
Author: 杨毅 |
Hits:
«
1
2
3
4
5
6
78
9
10
11
12
...
31
»